Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
نویسندگان
چکیده
منابع مشابه
The Ambulance Relocation and Dispatching Problem
Emergency medical services (EMS) generally deal with two real-time decisions: ambulance dispatching and relocation. Dispatching consists in selecting which ambulance to send to an emergency call, while relocation consists in determining how to modify the location of available ambulances throughout the day in response to changes in the state of the system. Although they have been mostly consider...
متن کاملSolving a Two-Period Cooperative Advertising Problem Using Dynamic Programming
Cooperative advertising is a cost-sharing mechanism in which a part of retailers' advertising investments are financed by the manufacturers. In recent years, investment among advertising options has become a difficult marketing issue. In this paper, the cooperative advertising problem with advertising options is investigated in a two-period horizon in which the market share in the second period...
متن کاملApproximate Dynamic Programming for Ambulance Redeployment
We present an approximate dynamic programming approach for making ambulance redeployment decisions in an emergency medical service system. The primary decision is where we should redeploy idle ambulances so as to maximize the number of calls reached within a given delay threshold. We begin by formulating this problem as a dynamic program. To deal with the high-dimensional and uncountable state ...
متن کاملAn approximate dynamic programming approach to solving dynamic oligopoly models
In this paper we introduce a new method to approximate Markov perfect equilibrium in large scale Ericson and Pakes (1995)-style dynamic oligopoly models that are not amenable to exact solution due to the curse of dimensionality. The method is based on an algorithm that iterates an approximate best response operator using an approximate dynamic programming approach based on linear programming. W...
متن کاملSolving the Fm∣block∣Cmax problem using Bounded Dynamic Programming
We present some results attained with two variants of Bounded Dynamic Programming algorithm to solve the Fm9block9Cmax problem using as an experimental data the well-known Taillard instances. We have improved the best known solutions for 17 of Taillard’s instances, including the 10 instances from set 12. & 2011 Elsevier Ltd. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2012
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2011.10.043